PENYELESAIAN VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) MENGGUNAKAN ALGORITMA GENETIKA HYBRID

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

متن کامل

An Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

متن کامل

Improved Simulated Annealing for Optimization of Vehicle Routing Problem with Time Windows (vrptw)

The Vehicle Routing Problem with Time Windows (VRPTW) is a combinatorial optimization problem that exists in various distribution systems. The problem deals with allocation of vehicles to service several customers, each customer has different available time, and the vehicles must visit the customers in their available time.This paper addresses the VRPTW by using an improved simulated annealing ...

متن کامل

Vehicle Routing Problem with Time Windows

The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. A...

متن کامل

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Enviromental Engineering and Sustainable Technology

سال: 2014

ISSN: 2356-3117

DOI: 10.21776/ub.jeest.2014.001.02.5